On Claw Free Families
نویسندگان
چکیده
On claw free families Abstract This paper points out that there are two types of claw free families with respect to a level of claw freeness. We formulate them as weak claw free families and strong claw free families. Then, we present suucient conditions for each type of claw free families. (A similar result is known for weak claw free families.) They are represented as some algebraic forms of one way functions. A new example of strong claw free families is also given.
منابع مشابه
Self - De nable Claw Free Functions
We propose a new type of claw free function family, a pseudo self-de nable claw free function family , which provides, by Damg ard's construction, a collision intractable hash function family that is more suitable in several cryptographic applications such as digital signature, bit commitment, etc. We give an example of self-de nable claw free function families based on the hardness of some num...
متن کاملRESOLVING STANLEY’S e-POSITIVITY OF CLAW-CONTRACTIBLE-FREE GRAPHS
In Stanley’s seminal 1995 paper on the chromatic symmetric function, he stated that there was no known graph that was not contractible to the claw and whose chromatic symmetric function was not e-positive, namely, not a positive linear combination of elementary symmetric functions. We resolve this by giving infinite families of graphs that are not contractible to the claw and whose chromatic sy...
متن کاملForbidden induced subgraphs for star-free graphs
Let H be a family of connected graphs. A graph G is said to be H-free if G is H-free for every graph H in H. In [1] it was pointed that there is a family of connected graphs H not containing any induced subgraph of the claw having the property that the set of H-free connected graphs containing a claw is finite, provided also that those graphs have minimum degree at least two and maximum degree ...
متن کاملEquimatchable Claw-Free Graphs
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable clawfree graph families. This characterization implies an efficient recognition algorithm.
متن کاملBounds on total domination in claw-free cubic graphs
A set S of vertices in a graphG is a total dominating set, denoted by TDS, ofG if every vertex ofG is adjacent to some vertex in S (other than itself). The minimum cardinality of a TDS ofG is the total domination number ofG, denoted by t(G). IfG does not contain K1,3 as an induced subgraph, then G is said to be claw-free. It is shown in [D. Archdeacon, J. Ellis-Monaghan, D. Fischer, D. Froncek,...
متن کامل